Disjunctive Modal Transition Systems and Generalized LTL Model Checking
نویسندگان
چکیده
Modal transition systems (MTS) is a well established formalism used for specification and for abstract interpretation. We consider its disjunctive extension (DMTS) and we show that refinement problems for DMTS are not harder than in the case of MTS. There are two main results in the paper. Firstly, we give a solution to the common implementation and specification problems lowering the complexity from EXPTIME to PTIME. Secondly, we identify a fundamental error made in previous attempts at LTL model checking of MTS and provide algorithms for LTL model checking of MTS and DMTS. Moreover, we show how to apply this result to compositional verification and circumvent the general incompleteness of the MTS composition. ∗The author has been supported by Czech Grant Agency grant no. GD102/09/H042.
منابع مشابه
On the Expressiveness of Refinement Settings
Embedded-systems designers often use transition systembased notations for specifying, with respect to some refinement preorder, sets of deterministic implementations. This paper compares popular such refinement settings — ranging from transition systems equipped with failure-pair inclusion to disjunctive modal transition systems — regarding the sets of implementations they are able to express. ...
متن کاملHennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking algorithms; the behavioural approach exploits various equivalence or refinement checking methods, provided the specifications are given in the same formalism as im...
متن کاملComparing Refinement Settings
The process of specializing a specification is called refinement. This concept is, e.g., frequently used in model-driven software development, where the process of development starts with an abstract model, which is refined in later design phases. If the final system should be runnable on a computer, this refinement process is continued until a concrete system, also called implementation, is re...
متن کاملin ri a - 00 00 07 53 , v er si on 1 - 1 6 N ov 2 00 5 Truly On - The - Fly LTL Model Checking
We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized Büchi automaton for the negation of the formula and the emptiness check. Our algorithm first converts the LTL formula into a linear weak alternating automaton; configurations of the alternating automaton correspond to the locations of a generalized Büchi automaton, and a varia...
متن کاملModel Checking Guarded Protocols
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, , comprised of a control process, , and finitely, but arbitrarily, many copies of a user process, , executing concurrently with interleaving semantics. We delineate the decidability/undecidability boundary of the PMCP for all possible systems that arise by letting proc...
متن کامل